SET SIZE AND THE PART–WHOLE PRINCIPLE

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set Size and the Part-whole Principle

Recent work has defended “Euclidean” theories of set size, in which Cantor’s Principle (two sets have equally many elements if and only if there is a one-toone correspondence between them) is abandoned in favor of the Part-Whole Principle (if A is a proper subset of B then A is smaller than B). It has also been suggested that Gödel’s argument for the unique correctness of Cantor’s Principle is ...

متن کامل

The size-principle: a deterministic output emerges from a set of probabilistic connections.

Orderly, size-related recruitment of motoneurones (MNs) illustrates how hundreds of cells operate as a functional entity to produce a highly deterministic output. The coherent action of the pool depends largely on the distribution of input to its members through the connections of afferent fibres. Three types of spike-triggered averaging have been utilized to study these connections. Impulses i...

متن کامل

Various explanations of the size principle

The size principle consists in the activation of motoneurons of a muscle pool in ascending order of their sizes when that pool of motoneurons receives a common, increasing input. This technical report is a survey of possible explanations of the size principle for recruitment of motor units. As a pre-study for further works, we collected existing explanations, suggested some new ones and collect...

متن کامل

A family of large set of size nine

 We investigate the existence of some‎ ‎large sets of size nine‎. ‎The large set $LS[9](2,5,29)$ is constructed and‎ ‎existence of the family $LS[9](2,5,27l+j)$ for $lgeq 1, ‎2leq‎ ‎j

متن کامل

Rank and fooling set size

Say that A is a Hadamard factorization of the identity In of size n if A ◦AT = In, where ◦ denotes the Hadamard or entrywise product, and AT denotes the transpose of A. As n = rk(In) = rk(A ◦ AT ) ≤ rk(A)2, it is clear that the rank of any Hadamard factorization of the identity must be at least √ n. Dietzfelbinger et al. [DHS96] raised the question if this bound can be achieved, and showed a bo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Review of Symbolic Logic

سال: 2013

ISSN: 1755-0203,1755-0211

DOI: 10.1017/s1755020313000221